Efficient Global Optimization of Non-Differentiable, Symmetric Objectives for Multi Camera Placement

نویسندگان

چکیده

We propose a novel iterative method for optimally placing and orienting multiple cameras in 3D scene. Sample applications include improving the accuracy of reconstruction, maximizing covered area surveillance, or coverage multi-viewpoint pedestrian tracking. Our algorithm is based on block-coordinate ascent combined with surrogate function an exclusion technique. This allows to flexibly handle difficult objective functions that are often expensive quantized non-differentiable. The solver globally convergent easily parallelizable. show how accelerate optimization by exploiting special properties function, such as symmetry. Additionally, we discuss trade-off between non-optimal stationary points cost reduction when optimizing viewpoints consecutively.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VEAP: Global optimization based efficient algorithm for VLSI placement

In this paper we present a very simple, efficient while effective placement algorithm for Row-based VLSIs. This algorithm is based on strict mathematical analysis, and provably can find the global optima. From our experiments, this algorithm is one of the fastest algorithms, especially for very large scale circuits. Another point desired to point out is that our algorithm can be run in both wir...

متن کامل

Camera Placement and Multi-Camera Fusion for Remote Robot Operation

This paper studies the impact of camera location and multi-camera fusion with real robots in an urban search and rescue task through two sets of experiments. In the first, we compared a camera with an overhead view to a traditional forward looking camera. In the second, we compared the use of a single forward looking camera to the use of two cameras, one on the front of the robot and one on the...

متن کامل

Adversarial Variational Optimization of Non-Differentiable Simulators

Complex computer simulators are increasingly used across fields of science as generative models tying parameters of an underlying theory to experimental observations. Inference in this setup is often difficult, as simulators rarely admit a tractable density or likelihood function. We introduce Adversarial Variational Optimization (AVO), a likelihood-free inference algorithm for fitting a non-di...

متن کامل

Non-differentiable Optimization of Fuzzy Logic Systems

In the present use of fuzzy logic systems tuning of their parameters has become an important issue. Many techniques, mainly based on the application of gradient descent, have been applied to this task generally in order to minimize a quadratic error function. The class of fuzzy logic systems using piecewise linear membership functions (e.g., triangular or trapezoidal) and/or minimum or maximum ...

متن کامل

Robust Optimization for Non-Convex Objectives

We consider robust optimization problems, where the goal is to optimize in the worst case over a class of objective functions. We develop a reduction from robust improper optimization to Bayesian optimization: given an oracle that returns αapproximate solutions for distributions over objectives, we compute a distribution over solutions that is α-approximate in the worst case. We show that deran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Sensors Journal

سال: 2022

ISSN: ['1558-1748', '1530-437X']

DOI: https://doi.org/10.1109/jsen.2021.3086037